Location:
Search - solution tsp s
Search list
Description: 一个模拟退火算法的程序，使用matlab编写。实现了tsp问题的求解-a simulated annealing procedures, the use of Matlab prepared. Implementation of the solution tsp
Platform: |
Size: 1024 |
Author: 蒋赛 |
Hits:
Description: 用遗传算法解决旅行商问题，并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能，包括：运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared using roulette selection operator and tournament selection operator of genetic algorithm to solve TSP s performance issues, including: run time, the evolution of the overall quality of algebra and the optimal solution. The results of curve can be used graphics displayed.
Platform: |
Size: 71680 |
Author: sdfsfdsf |
Hits:
Description: 利用模拟退火算法解决50个城市的tsp问题，简单易懂，适合初学者-The use of simulated annealing algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners
Platform: |
Size: 3072 |
Author: dayong |
Hits:
Description: 模拟退火和对称
*欧几里德旅行商问题。
*
*为基础的解决办法的本地搜索启发式
*非过境道路和近邻
-/*
* Simulated annealing and the Symetric
* Euclidian Traveling Salesman Problem.
*
* Solution based on local search heuristics for
* non-crossing paths and nearest neighbors
*
* Storage Requirements: n^2+4n ints
*
* Problem: given the coordinates of n cities in the plane, find a
* permutation pi_1, pi_2, ..., pi_n of 1, 2, ..., n that minimizes
* sum for 1<=i<n D(pi_i,pi_i+1), where D(i,j) is the euclidian
* distance between cities i and j
*
* Note: with n cities, there is (n-1)!/2 possible tours.
* factorial(10)=3628800 factorial(50)=3E+64 factorial(150)=5.7E+262
* If we could check one tour per clock cycle on a 100 MHZ computer, we
* would still need to wait approximately 10^236 times the age of the
* universe to explore all tours for 150 cities.
*
* gcc-O4-o tsp tsp.c-lm tsp | ghostview-
*
* Usage: tsp [-v] [n=dd] [s=dd] [filename]
* -v : verbose
* n= : nb of cities (cities generated randomly on E^2
Platform: |
Size: 86016 |
Author: 孙博 |
Hits:
Description: 查找附近的最优解的遗传算法的TSP的使用-Find the optimal solution near the TSP' s use of genetic algorithms
Platform: |
Size: 3072 |
Author: sunling |
Hits:
Description: 用贪心算法实现tsp(旅行商问题)求解，实现中国34个城市环游路线-With the greedy algorithm tsp (TSP) solution to achieve China' s 34 cities around the line
Platform: |
Size: 340992 |
Author: 冰袋 |
Hits:
Description: Approximate solution for the Traveling
Salesman’s Problem Using Continuous
Hopfield Network, matlab TSP
Platform: |
Size: 2048 |
Author: cloud |
Hits:
Description: 蚁群算法的TSP问题解决方法，对于蚁群算法的了解有很大的帮助-ant arithmatic TSP problem solution, it s helpful for you to understand ant arithmatic.
Platform: |
Size: 31744 |
Author: 郭贤捷 |
Hits:
Description: 求解TSP问题的性能，包括：运行时间、进化总代数和最优解质量。-to solve TSP s performance issues, including: run time, the evolution of the overall quality of algebra and the optimal solution.
Platform: |
Size: 4096 |
Author: 王峰 |
Hits:
Description: 模拟退火算法(Simulated Annealing，SA)最早的思想是由N. Metropolis [1] 等人于1953年提出。1983 年,S. Kirkpatrick 等成功地将退火思想引入到组合优化领域。它是基于Monte-Carlo迭代求解策略的一种随机寻优算法，其出发点是基于物理中固体物质的退火过程与一般组合优化问题之间的相似性。(The earliest idea of Simulated Annealing (SA) was put forward by N. Metropolis [1] and others in 1953. In 1983, S. Kirkpatrick successfully introduced the idea of annealing to the field of combinatorial optimization. It is a stochastic optimization algorithm based on the Monte-Carlo iterative solution strategy. The starting point is based on the similarity between the annealing process of solid matter in physics and the general combinatorial optimization problem.)
Platform: |
Size: 152576 |
Author: 绝情逆空 |
Hits: